implicit data structure造句

例句与造句

1. These properties make this heap implementation a simple example of an implicit data structure or Ahnentafel list.
2. Min-max heaps are often represented implicitly in an " array "; hence it's referred to as an implicit data structure.
3. Binary trees can also be stored in breadth-first order as an implicit data structure in arrays, and if the tree is a complete binary tree, this method wastes no space.
4. Functions and procedures written in concatenative style are not pipeline, a sequence of operations that take parameters from an implicit data structure on which all functions operate, and return the function results to that shared structure so that it will be used by the next operator.
5. Simple implicit data structures, such as representing a sorted list as an array, may be very efficient as a static data structure, but inefficient as a dynamic data structure, due to modification operations ( such as insertion in the case of a sorted list ) being inefficient.
6. It's difficult to find implicit data structure in a sentence. 用implicit data structure造句挺难的
7. This can be generalized to a complete binary tree ( where the last level may be incomplete ), which yields the best-known example of an implicit data structure, namely the " binary heap ", which is an implicit data structure for a priority queue.
8. This can be generalized to a complete binary tree ( where the last level may be incomplete ), which yields the best-known example of an implicit data structure, namely the " binary heap ", which is an implicit data structure for a priority queue.
9. Binary heaps are also commonly employed in the heapsort sorting algorithm, which is an in-place algorithm owing to the fact that binary heaps can be implemented as an implicit data structure, storing keys in an array and using their relative positions within that array to represent child-parent relationships.
10. An important example of an implicit data structure is representing a perfect binary tree as a list, in increasing order of depth, so root, first left child, first right child, first left child of first left child, etc . Such a tree occurs notably for an ancestry chart to a give depth, and the implicit representation is known as an " Ahnentafel " ( ancestor table ).
11. Historically, defined an implicit data structure ( and algorithms acting on one ) as one " in which structural information is implicit in the way data are stored, rather than explicit in pointers . " They are somewhat vague in the definition, defining it most strictly as a single array, with only the size retained ( a single number of overhead ), or more loosely as a data structure with constant overhead ( " O " ( 1 ) ).